Solving 10385 - Duathlon (Ternary search)
[andmenj-acm.git] / 10110 - Light, more light / 10110-2.cpp
blob733a0f832e09ef62dc32074a2f387340ce3f364c
1 #include <stdio.h>
3 int main()
5 {
6 unsigned int num,i,j;
7 char step;
9 scanf("%d",&num);
11 while (num!=0)
13 step=0;
14 i=4;
15 j=5;
17 while (num>i && i>0)
19 i+=j;
20 j+=2;
23 if (num==i) printf("yes\n");
24 else printf("no\n");
25 scanf("%d",&num);
28 return 0;